Spatially Directional Predictive Coding for Block-based Compressive Sensing of Natural Images

A novel coding strategy for block-based compressive sens-ing named spatially directional predictive coding (SDPC) is proposed, which efficiently utilizes the intrinsic spatial cor-relation of natural images. At the encoder, for each block of compressive sensing (CS) measurements, the optimal pre-diction is selected from a set of prediction candidates that are generated by four designed directional predictive modes. Then, the resulting residual is processed by scalar quantiza-tion (SQ). At the decoder, the same prediction is added onto the de-quantized residuals to produce the quantized CS measurements, which is exploited for CS reconstruction. Experimental results substantiate significant improvements achieved by SDPC-plus-SQ in rate distortion performance as compared with SQ alone and DPCM-plus-SQ.Comment: 5 pages, 3 tables, 3 figures, published at IEEE International Conference on Image Processing (ICIP) 2013 Code Avaiable: http://idm.pku.edu.cn/staff/zhangjian/SDPC

Cooperative relay selection for load balancing with mobility in hierarchical WSNs: A multi-armed bandit approach

© 2013 IEEE. Energy efficiency is the major concern in hierarchical wireless sensor networks(WSNs), where the major energy consumption originates from radios for communication. Due to notable energy expenditure of long-range transmission for cluster members and data aggregation for Cluster Head (CH), saving and balancing energy consumption is a tricky challenge in WSNs. In this paper, we design a CH selection mechanism with a mobile sink (MS) while proposing relay selection algorithms with multi-user multi-armed bandit (UM-MAB) to solve the problem of energy efficiency. According to the definition of node density and residual energy, we propose a conception referred to as a Virtual Head (VH) for MS to collect data in terms of energy efficiency. Moreover, we naturally change the relay selection problem into permutation problem through employing the two-hop transmission in cooperative power line communication, which deals with long-distance transmission. As far as the relay selection problem is concerned, we propose the machine learning algorithm, namely MU-MAB, to solve it through the reward associated with an increment for energy consumption. Furthermore, we employ the stable matching theory based on marginal utility for the allocation of the final one-to-one optimal combinations to achieve energy efficiency. In order to evaluate MU-MAB, the regret is taken advantage to demonstrate the performance by using upper confidence bound (UCB) index. In the end, simulation results illustrate the efficacy and effectiveness of our proposed solutions for saving and balancing energy consumption

Precise Phase Transition of Total Variation Minimization

Characterizing the phase transitions of convex optimizations in recovering structured signals or data is of central importance in compressed sensing, machine learning and statistics. The phase transitions of many convex optimization signal recovery methods such as $\ell_1$ minimization and nuclear norm minimization are well understood through recent years' research. However, rigorously characterizing the phase transition of total variation (TV) minimization in recovering sparse-gradient signal is still open. In this paper, we fully characterize the phase transition curve of the TV minimization. Our proof builds on Donoho, Johnstone and Montanari's conjectured phase transition curve for the TV approximate message passing algorithm (AMP), together with the linkage between the minmax Mean Square Error of a denoising problem and the high-dimensional convex geometry for TV minimization.Comment: 6 page